Degrees of nonlinearity in forbidden 0–1 matrix problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degrees of nonlinearity in forbidden 0-1 matrix problems

A 0-1 matrix A is said to avoid a forbidden 0-1 matrix (or pattern) P if no submatrix of A matches P , where a 0 in P matches either 0 or 1 in A. The theory of forbidden matrices subsumes many extremal problems in combinatorics and graph theory such as bounding the length of Davenport-Schinzel sequences and their generalizations, Stanley and Wilf’s permutation avoidance problem, and Turán-type ...

متن کامل

Random graphs with forbidden vertex degrees

We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S , the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter b μ given as the root of a certain ‘characteristic equation’ of S that maximizes a certain function ψS(μ). Subject to a hypot...

متن کامل

Nonlinearity of Matrix Groups

The aim of this short note is to answer a question by Guoliang Yu of whether the group EL3(Z〈x, y〉), where Z〈x, y〉 is the free (non-commutative) ring, has any faithful finite dimensional linear representations over a field. Recall that for every (associative unitary) ring R the group ELn(R) is the subgroup of GLn(R) generated by all n × n-elementary matrices xij(r) = Id + reij (r ∈ R, 1 ≤ i 6= ...

متن کامل

The role of nonlinearity in inverse problems

In many practical inverse problems, one aims to retrieve a model that has infinitely many degrees of freedom from a finite amount of data. It follows from a simple variable count that this cannot be done in a unique way. Therefore, inversion entails more than estimating a model: any inversion is not complete without a description of the class of models that is consistent with the data; this is ...

متن کامل

Degrees of freedom in lasso problems

We derive the degrees of freedom of the lasso fit, placing no assumptions on the predictor matrix X. Like the well-known result of Zou et al. (2007), which gives the degrees of freedom of the lasso fit when X has full column rank, we express our result in terms of the active set of a lasso solution. We extend this result to cover the degrees of freedom of the generalized lasso fit for an arbitr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2011

ISSN: 0012-365X

DOI: 10.1016/j.disc.2011.06.020